Program Synthesis and Linear Operator Semantics
نویسندگان
چکیده
منابع مشابه
Program Synthesis and Linear Operator Semantics
For deterministic and probabilistic programs we investigate the problem of program synthesis and program optimisation (with respect to non-functional properties) in the general setting of global optimisation. This approach is based on the representation of the semantics of programs and program fragments in terms of linear operators, i.e. as matrices. We exploit in particular the fact that we ca...
متن کاملJ an 2 00 4 Operator synthesis II . Individual synthesis and linear operator equations
The second part of our work on operator synthesis deals with individual operator synthesis of elements in some tensor products, in particular in Varopoulos algebras, and its connection with linear operator equations. Using a developed technique of “approximate inverse intertwining” we obtain some generalizations of the Fuglede and the Fuglede-Weiss theorems and solve some problems posed in [O, ...
متن کاملFe b 20 04 Operator synthesis II . Individual synthesis and linear operator equations
The second part of our work on operator synthesis deals with individual operator synthesis of elements in some tensor products, in particular in Varopoulos algebras, and its connection with linear operator equations. Using a developed technique of “approximate inverse intertwining” we obtain some generalizations of the Fuglede and the Fuglede-Weiss theorems and solve some problems posed in [O, ...
متن کاملComplete Program Synthesis for Linear Arithmetics
Program synthesis, or their fragments, is a way to write programs by providing only its meaning, without worrying about the implementation details. It avoids the drawback of writing sequential code, which might be di cult to check, error-prone or tedious. Our contribution is to provide complete program synthesis algorithms with unbounded data types in decidable theories. We present synthesis al...
متن کاملSymbolic Synthesis of Knowledge-based Program Implementations with Synchronous Semantics
This paper deals with the automated synthesis of implementations of knowledge-based programs with respect to two synchronous semantics (clock and synchronous perfect recall). An approach to the synthesis problem based on the use of symbolic representations is described. The method has been implemented as an extension to the model checker MCK. Two applications of the implemented synthesis system...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2014
ISSN: 2075-2180
DOI: 10.4204/eptcs.157.6